On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes
نویسندگان
چکیده
منابع مشابه
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n− p n(n− 2t− 2) errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomialtime list-decoding algorithms for the same codes, the new algorithm corrects approximately t/2n extra errors.
متن کاملList decoding of binary codes
We briefly survey some recent progress on list decoding algorithms for binary codes. The results discussed include: – Algorithms to list decode binary Reed-Muller codes of any order up to the minimum distance, generalizing the classical GoldreichLevin algorithm for RM codes of order 1 (Hadamard codes). These algorithms are “local” and run in time polynomial in the message length. – Construction...
متن کاملList-Decoding Multiplicity Codes
We study the list-decodability of multiplicity codes. These codes, which are based on evaluations of high-degree polynomials and their derivatives, have rate approaching 1 while simultaneously allowing for sublinear-time error-correction. In this paper, we show that multiplicity codes also admit powerful list-decoding and local list-decoding algorithms correcting a large fraction of errors. Sta...
متن کاملIterative list-decoding of Gabidulin codes via Gröbner based interpolation
We show how Gabidulin codes can be list decoded by using an iterative parametrization approach. For a given received word, our decoding algorithm processes its entries one by one, constructing four polynomials at each step. This then yields a parametrization of interpolating solutions for the data so far. From the final result a list of all codewords that are closest to the received word with r...
متن کاملList Decoding of Subspace Codes
Codes constructed as subsets of the projective geometry of a vector space over a finite field have recently been shown to have applications as unconditionally secure authentication codes and random network error correcting codes. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or equivalently, a subset of the vertices o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2243800